The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity
نویسندگان
چکیده
Any finite, separately convex, positively homogeneous function on R is convex. This was first established in [1]. In this paper, we give a new and concise proof of this result, and we show that it fails in higher dimension. The key of the new proof is the notion of perspective of a convex function f , namely, the function (x, y) → yf(x/y), y > 0. In recent works [9, 10, 11], the perspective has been substantially generalized by considering functions of the form (x, y) → g(y)f(x/g(y)), with suitable assumptions on g. Here, this generalized perspective is shown to be a powerful tool for the analysis of convexity properties of parametrized families of matrix functions.
منابع مشابه
Convexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملThe convexity of the integral operator on the class of the integral operator on the class B(mu,alpha)
In this paper, we study the convexity of the integral operator
متن کاملCERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS
The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk
متن کاملOn difference sequence spaces defined by Orlicz functions without convexity
In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007